Group Testing Algorithms: Bounds and Simulations
نویسندگان
چکیده
منابع مشابه
Noisy Adaptive Group Testing: Bounds and Algorithms
The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possibly-noisy tests, and is relevant in applications such as medical testing, communication protocols, pattern matching, and many more. One of the defining features of the group testing problem is the distinction between the non-adaptive and adaptive settings: In the...
متن کاملEfficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing
In the k-junta testing problem, a tester has to efficiently decide whether a given function f : {0, 1} → {0, 1} is a kjunta (i.e., depends on at most k of its input bits) or is ε-far from any k-junta. Our main result is a quantum algorithm for this problem with query complexity Õ( √ k/ε) and time complexity Õ(n √ k/ε). This quadratically improves over the query complexity of the previous best q...
متن کاملQuantum algorithms for search with wildcards and combinatorial group testing
We consider two combinatorial problems. The first we call “search with wildcards”: given an unknown n-bit string x, and the ability to check whether any subset of the bits of x is equal to a provided query string, the goal is to output x. We give an optimal O( √ n) quantum query algorithm for search with wildcards. Rather than using amplitude amplification or a quantum walk, our algorithm is ul...
متن کاملClassical and Quantum Algorithms for Testing Equivalence of Group Extensions
While efficient algorithms are known for solving many important problems related to groups, no efficient algorithm is known for determining whether two arbitrary groups are isomorphic. The particular case of 2-nilpotent groups, a special type of central extension, is widely believed to contain the essential hard cases. However, looking specifically at central extensions, the natural formulation...
متن کاملComparative testing of DNA segmentation algorithms using benchmark simulations.
Numerous segmentation methods for the detection of compositionally homogeneous domains within genomic sequences have been proposed. Unfortunately, these methods yield inconsistent results. Here, we present a benchmark consisting of two sets of simulated genomic sequences for testing the performances of segmentation algorithms. Sequences in the first set are composed of fixed-sized homogeneous d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2314472